A Synthesis of Pulse Influenza Vaccination Policies Using an Efficient Controlled Elitism Non-Dominated Sorting Genetic Algorithm (CENSGA)

نویسندگان

چکیده

Seasonal influenza (also known as flu) is responsible for considerable morbidity and mortality across the globe. The three recognized pathogens that cause epidemics during winter season are A, B C. virus particularly dangerous due to its mutability. Vaccines an effective tool in preventing seasonal influenza, their formulas updated yearly according WHO recommendations. However, order facilitate decision-making planning of intervention, policymakers need information on projected costs quantities related introducing vaccine help governments obtain optimal allocation each year. In this paper, approach based a Controlled Elitism Non-Dominated Sorting Genetic Algorithm (CENSGA) model introduced optimize vaccination. A bi-objective formulated control infection volume, reduce unit cost vaccination campaign. An SIR (Susceptible–Infected–Recovered) employed representing potential epidemic. constraints epidemiological model, time management quantity. two-phase optimization process proposed: guardian followed by contingent controls. proposed evolutionary metaheuristic multi-objective algorithm with local search procedure hash table. Moreover, scheduling set policies over predetermined form complete campaign, extended CENSGA variable-length chromosome (VLC) along mutation crossover operations. To validate applicability CENSGA, it compared classical (NSGA-II). results indicate campaigns compromise tradeoffs between two conflicting objectives can be designed effectively using providing number alternatives accommodate best strategies. analyzed graphical statistical comparisons terms cardinality, convergence, distribution spread quality metrics, illustrating useful determining campaigns.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

Optimal Distribution System Reconfiguration Using Non-dominated Sorting Genetic Algorithm (NSGA-II)

In this paper, a Non-dominated Sorting Genetic Algorithm-II (NSGA-II) based approach is presented for distribution system reconfiguration. In contrast to the conventional GA based methods, the proposed approach does not require weighting factors for conversion of multi-objective function into an equivalent single objective function. In order to illustrate the performance of the proposed method,...

متن کامل

A method for identifying software components based on Non-dominated Sorting Genetic Algorithm

Identifying the appropriate software components in the software design phase is a vital task in the field of software engineering and is considered as an important way to increase the software maintenance capability. Nowadays, many methods for identifying components such as graph partitioning and clustering are presented, but most of these methods are based on expert opinion and have poor accur...

متن کامل

Multi-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm

The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...

متن کامل

An Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem

Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11223711